当前位置：
首页 资源下载
搜索资源 - java traveling salesman
搜索资源列表
-
0下载：
用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs
-
-
0下载：
利用遗传算法解决TSP旅行商问题的Java原码-using genetic algorithms to solve the traveling salesman problem TSP original Java code
-
-
0下载：
利用模拟退火算法解决旅行商问题的java原码-using simulated annealing algorithm to solve the traveling salesman problem java original code
-
-
1下载：
Traveling Salesman Problem Java Genetic Algorithm Solution, Hope all enjoy it.
-
-
0下载：
使用禁忌搜索算法求解TSP（旅行商问题）的JAVA源程序,The use of tabu search algorithm for solving TSP (Traveling Salesman Problem) the JAVA source code
-
-
0下载：
模拟退火算法解决旅行商问题，从文件读入城市信息,Simulated annealing algorithm to solve traveling salesman problem, reading from the file information into the city
-
-
0下载：
旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its descr iption of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path
-
-
0下载：
用很简单的方法描述了如何勇贪婪算法解决旅行商问题-Using very simple methods Yong describes how greedy algorithm to solve traveling salesman problem
-
-
0下载：
旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its descr iption of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path
-
-
0下载：
Brute force solution for the traveling salesman problem
-
-
0下载：
GA_Traffic
The Traveling Salesman Problem (TSP) is maybe the archetypical problem
in combinatorial optimization. This problem and its generalizations, vehicle
routing problems, have been studied for more than thirty years two entire
monograph
-
-
0下载：
遗传算法求解旅行商问题。在n=20的情况下依然能90 以上获得正确解。-Genetic Algorithm for Traveling Salesman Problem. In the case of n = 20 can still obtain the correct solution for more than 90 .
-
-
0下载：
利用回溯法实现了旅行售货员的算法,代码为java.-Achieved by backtracking the traveling salesman algorithms.
-
-
0下载：
分支限界法实现旅行售货员问题，使用时间挺短的，代码可读性强-Branch and bound to achieve the traveling salesman problem, the use of time very short, readable code
-
-
0下载：
ＪＡＶＡ语言实现的遗传算法解决TSP（旅行商问题），主要有三个简单的Java类。-JAVA language of the genetic algorithm to solve TSP (traveling salesman problem), there are three simple Java class.
-
-
0下载：
蚂蚁算法的java实现
或称蚁群算法
用于解决TSP旅行商问题
尚待优化-Ant algorithm to achieve the java or ant colony algorithm to solve TSP traveling salesman problem yet to optimize
-
-
0下载：
The task of this application was to explore the possibilities of genetic programming and to test it
on a well known Traveling Salesman Problem (TSP), where the salesman should visit given number
of cities and then return back home, all in the sho
-
-
0下载：
用java语言开发基于遗传算法理论的旅行商最短路径问题，包含遗传算法的常用基本理论。-The basic theory of common java language development based on the traveling salesman problem based on genetic theory shortest path algorithms, including genetic algorithm.
-
-
0下载：
JAVA实现旅行商问题，有简单的可视化界面
有N个城市，要求从其中某个问题出发，唯一遍历所有城市，再回到出发的城市，求最短的路线。使用模拟退火算法可以比较快的求出TSP的一条近似最优路径。-JAVA traveling salesman problem, a simple visual interface
There are N cities, which to ask a question, the only way to traverse all cities, and then
-
-
0下载：
tsp的java源码实现旅行商问题，即TSP问题（Traveling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(The Java source of TSP is one of the famous problems in the field of mathemati
-
